separable permutations造句

例句与造句

1. The permutations for which this partial order is series-parallel are exactly the separable permutations.
2. Separable permutations also closely related to series-parallel partial orders, the partially ordered sets whose comparability graphs are the cographs.
3. As with the cographs and separable permutations, the series-parallel partial orders may also be characterized by four-element forbidden suborders.
4. As they show, the class of permutations that are transformed by this process into the all-one matrix is exactly the class of separable permutations.
5. This technique was later generalized to algorithms for finding longest common patterns of separable permutations; however, the longest common pattern problem is NP-complete for arbitrary permutations.
6. It's difficult to find separable permutations in a sentence. 用separable permutations造句挺难的
7. Each subtree of a separating tree may be interpreted as itself representing a smaller separable permutation, whose element values are determined by the shape and sign pattern of the subtree.
8. As prove, separable permutations may also be characterized in terms of permutation patterns : a permutation is separable if and only if it contains neither 2413 nor 3142 as a pattern.
9. considered separable permutations again in their study of bootstrap percolation, a process in which an initial permutation matrix is modified by repeatedly changing to one any matrix coefficient that has two or more orthogonal neighbors equal to one.
10. The separable permutations also have a characterization from algebraic geometry : if a collection of distinct real polynomials all have equal values at some number, then the permutation that describes how the numerical ordering of the polynomials changes at is separable, and every separable permutation can be realized in this way.
11. The separable permutations also have a characterization from algebraic geometry : if a collection of distinct real polynomials all have equal values at some number, then the permutation that describes how the numerical ordering of the polynomials changes at is separable, and every separable permutation can be realized in this way.
12. Separable permutations may also be used to describe hierarchical partitions of rectangles into smaller rectangles ( so-called " slicing floorplans ", used for instance in the design of integrated circuits ) by using the positive and negative signs of the separating tree to describe horizontal and vertical slices of a rectangle into smaller rectangles.
13. Permutations whose decomposition by skew and direct sums into a maximal number of parts, that is, can be built up from the permutations ( 1 ), are called separable permutations; they arise in the study of sortability theory, and can also be characterized as permutations avoiding the permutation patterns 2413 and 3142.